1765B - Broken Keyboard - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define mod 1e7
#define int long long
#define pi 3.14159265359
#define vi vector<int>
#define vp vector<pair<int, int>>
#define pb push_back
#define F first
#define S second
#define sortfull(a) sort(a.begin(), a.end())
#define full(a) (a.begin(), a.end())
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, a, b) for (int i = a; i < b; i++)
#define vvi vector<vector<int>>
#define Map map<int, int>
#define VMap map<int, vector<int>>
#define debug(x) cout << x << endl
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
int fact(int n)
{
    if (n == 1)
        return 1;
    return n * fact(n - 1);
}
int lcm(int a, int b)
{
    return a * b / __gcd(a, b);
}
void check()
{
    cout << "HEllo Harsh" << endl;
}
void solve()
{
    int n;
    cin >> n;
    string s;
    cin >> s;
    if (n == 1)
    {
        cout << "YES" << endl;
        return;
    }
    int x = 0;
    for (int i = 0; i < n; i++)
    {
        if (x == 0)
        {
            x = 1;
        }
        else
        {
            if (i == n - 1 || s[i] != s[i + 1])
            {
                cout << "NO" << endl;
                return;
            }
            i++;
            x = 0;
        }
    }
    cout << "YES" << endl;
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int baital;
    cin >> baital;
    while (baital--)
    {
        solve();
    }
}